A Parallel Implementation of Buchberger's Algorithm overZpforp≤ 31991

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A parallel implementation of the QR-algorithm

In this paper a parallel implementation of the QR algorithm for the eigenvalues of a non-Hermitian matrix is proposed. The algorithm is designed to run eeciently on a linear array of processors that communicate by accessing their neighbors' memory. A module for building such arrays, the Maryland crab, is also described.

متن کامل

A Parallel Implementation of theBlock - GTH algorithm

The GTH algorithm is a very accurate direct method for nding the stationary distribution of a nite-state, discrete time, irreducible Markov chain. O'Leary and Wu developed the block-GTH algorithm and successfully demonstrated the eeciency of the algorithm on vector pipeline machines and on workstations with cache memory. In this paper, we discuss the parallel implementation of the block-GTH alg...

متن کامل

Parallel Implementation of Apriori Algorithm

Association rule mining concept is used to show relation between items in a set of items. Apriori algorithm for mining frequent itemsets from large amount of database is used. Parallelism is used to reduce time and increase performance, Multi-core processor is used for parallelization. Mining in a Serial manner can consume time and reduce performance for mining. To solve this issue we are propo...

متن کامل

A parallel Bees Algorithm implementation on GPU

Bees Algorithm is a population-based method that is a computational bound algorithm whose inspired by the natural behavior of honey bees to finds a near-optimal solution for the search problem. Recently, many parallel swarm based algorithms have been developed for running on GPU (Graphic Processing Unit). Since nowadays developing a parallel Bee Algorithm running on the GPU becomes very importa...

متن کامل

A decentralized parallel implementation for parallel tempering algorithm

Parallel tempering (PT), also known as replica exchange, is a powerful Markov Chain Monte Carlo sampling approach, which aims at reducing the relaxation time in simulations of physical systems. In this paper, we present a novel decentralized parallel implementation of PT using the message passing interface (MPI) and the scalable parallel random number generators (SPRNG) library. By taking advan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 1998

ISSN: 0747-7171

DOI: 10.1006/jsco.1998.0208